Time-Space Trade-off Algorithms for Triangulating a Simple Polygon∗
نویسندگان
چکیده
An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We present a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices that runs in O(n/s+ n logn log(n/s)) expected time using O(s) variables, for any s ≤ n. In particular, when s ≤ n logn log5 logn the algorithm runs in O(n/s) expected time.
منابع مشابه
Time-Space Trade-offs for Triangulating a Simple Polygon
An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We present a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices that runs in O(n/s+ n logn log(n/s)) expected time using O(s) variables, for any s ≤ n. In particular, when s ≤ n logn log5 lo...
متن کاملA New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms
We are given a read-only memory for input and a write-only stream for output. For a positive integer parameter s, an s-workspace algorithm is an algorithm using only O(s) words of workspace in addition to the memory for input. In this paper, we present an O(n/s)-time s-workspace algorithm for subdividing a simple polygon into O(min{n/s, s}) subpolygons of complexity O(max{n/s, s}). As applicati...
متن کاملAn O(n log log n)-Time Algorithm for Triangulating a Simple Polygon
Given a simple n-vertex polygon, the triangulation problem is to partition the interior of the polygon into n-2 triangles by adding n-3 nonintersecting diagonals. We propose an O(n log logn)-time algorithm for this problem, improving on the previously best bound of O (n log n) and showing that triangu-lation is not as hard as sorting. Improved algorithms for several other computational geometry...
متن کاملTriangulating a Simple Polygon in Linear Time
Triangulating a simple polygon has been one of the most outstanding open problems in two-dimensional computational geometry. It is a basic primitive in computer graphics and, generally, seems the natural preprocessing step for most nontrivial operations on simple polygons [5,13]. Recall that to triangulate a polygon is t o partition it into triangles without adding any new vertices. Despite its...
متن کاملTesting a Simple Polygon for Monotonicity Optimality in Parallel
Sumanta Guhat We show that, in parallel, an n-vertex simple polygon can be tested for monotonicity optimally in O(logn) time using O(n/logn) EREW PRAM processors, and we present two different optimal parallel algorithms for solving this problem. OUf result leads to an optimal parallcl algorithm for triangulating simple polygons that runs in O(logn) time using O(n/logn) EREW PRA!\I processors if...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017